1975A - Bazoka and Mocha's Array - CodeForces Solution

def is_sorted(arr):
        return all(arr[i] <= arr[i + 1] for i in range(len(arr) - 1))

def can_be_sorted_by_rotations(arr):
    n = len(arr)
        for i in range(n):
        rotated = arr[i:] + arr[:i]
        if is_sorted(rotated):
            return True
    return False

def main():
    import sys
    input = sys.stdin.read
    data = input().split()
    
    index = 0
    t = int(data[index])
    index += 1
    results = []
    
    for _ in range(t):
        n = int(data[index])
        index += 1
        a = list(map(int, data[index:index + n]))
        index += n
        if can_be_sorted_by_rotations(a):
            results.append("Yes")
        else:
            results.append("No")
    
    for result in results:
        print(result)

if __name__ == "__main__":
    main()